Towards Higher-Order DL-Lite

نویسندگان

  • Giuseppe De Giacomo
  • Maurizio Lenzerini
  • Riccardo Rosati
چکیده

In several application domains, the need arises of modeling and reasoning about meta-concepts and meta-properties. This is the case, for example, with information system interoperability, where a description of the data schema (or, the ontology) of one system should co-exist with the specification of the application domain described by the data schema itself. In logic, higher-order constructs are needed for a correct representation of concepts and properties at the meta-level. Current research on Description Logics mainly focuses on their ability for specifying the domain of interest, while the issue of devising suitable extensions to these logics for representing and reasoning about meta-level elements is largely unexplored. In this paper, we present the first results of our investigation on extending DL-Lite with higher-order capabilities. We show that basic higherorder constructs can be safely added to DL-lite while keeping all the reasoning tasks tractable, including answering conjunctive queries mixing object-level and meta-level elements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining DL-Lite with Spatial Calculi for Feasible Geo-thematic Query Answering

First order logic (FOL) rewritability is a desirable feature for query answering over geo-thematic ontologies because in most geoprocessing scenarios one has to cope with large data volume. Hence, there is a need for combined geo-thematic logics that provide a sufficiently expressive query language allowing for FOL rewritability. The DL-Lite family of description logics is tailored towards FOL ...

متن کامل

Towards Temporal Fuzzy Query Answering on Stream-based Data

For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...

متن کامل

When OWL met DL-Lite

Recent research in the area of ontology representation for the Semantic Web has led to several different language proposals. Among the others, it led to the standardization of OWL, on one hand, and to the emergence of the DL-Lite family of Description Logics, on the other hand. These two outcomes mainly differ on their objective: while OWL aims to be a standard, and as such, it is tailored towa...

متن کامل

Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics

We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all minimal subsets of a given DL-Lite knowledge base that have a given consequence. We show that for theDL-Litecore,DL-Litekrom andDLLiteHN horn fragments such minimal subsets are efficiently enumerable with polynomial dela...

متن کامل

Scalable Geo-thematic Query Answering

First order logic (FOL) rewritability is a desirable feature for query answering over geo-thematic ontologies because in most geoprocessing scenarios one has to cope with large data volumes. Hence, there is a need for combined geo-thematic logics that provide a sufficiently expressive query language allowing for FOL rewritability. The DL-Lite family of description logics is tailored towards FOL...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008